Dominating sets in de Bruijn graphs
نویسندگان
چکیده
In this paper we deal with different type of dominating sets in de Bruijn graphs and we prove a conjecture on perfect dominating sets.
منابع مشابه
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملA Characterization of Maximum Independent Sets of De Bruijn Graphs
The de Bruijn graph B(d, 3) consists of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs B(d, 3) and for the de Bruijn graph with loops removed, for all d. We derive a recurrence relation for their number.
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملOn (d, 2)-dominating numbers of binary undirected de Bruijn graphs
In this paper, we show that: (i) For n-dimensional undirected binary de Bruijn graphs, UB(n), n¿4, there is a vertex x=x1 x1 x1 · · · x1x1 (x1=1 or 0) such that for any other vertex t there exist at least two internally disjoint paths of length at most n−1 between x and t in UB(n), i.e., the (n −1; 2)-dominating number of UB(n) is equal to one. (ii) For n¿5, let S={100 · · · 01; 011 · · · 10}. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002